Grapheme-to-phoneme conversion based on TBL algorithm in Mandarin TTS system

نویسندگان

  • Min Zheng
  • Qin Shi
  • Wei Zhang
  • Lianhong Cai
چکیده

Grapheme-to-phoneme (G2P) conversion is an important component in a Text-to-Speech (TTS) system. The difficulty in Chinese G2P conversion is to pick out one correct pronunciation from several candidates according to the context information. By evaluating the distribution of polyphones in a corpus with manually corrected pinyin transcriptions, this paper pointed out that the overall error rate of G2P conversion was greatly decreased after processing 78 key polyphones. This paper proposed a transformation-based error-driven learning (TBL) algorithm to solve G2P conversion for polyphones. The correct rates of G2P for polyphones, which originally have high accuracy or low accuracy, are both improved. Besides, two additional experiments show that the capacity of the TBL algorithm has great relationships with initial status and TBL algorithm is more suitable than decision tree to solve polyphones’ G2P problem. Keyword: Grapheme-to-Phoneme (G2P); TransformationBased Learning (TBL); Decision Tree (DT); polyphone

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Way to Learn Rules for Grapheme-to-Phoneme Conversion in Chinese

Grapheme-to-phoneme (G2P) conversion is a very important component in a Text-to-Speech (TTS) system. Determining the pronunciation of polyphone characters is the main problem that the G2P component in a Mandarin TTS system faces. By studying the distribution of polyphones and their characteristics in a large text corpus with corrected pinyin transcriptions, this paper points out that correct G2...

متن کامل

Dialect variation in Boro Language and Grapheme-to-Phoneme conversion rules to handle lexical lookup fails in Boro TTS System

It is not possible to include all the words in a natural language for general text-to-speech system. Grapheme-tophoneme conversion system is essential to pronounce a word which is out of vocabulary. Grapheme-to-phoneme rules play a vital role where lexical lookup fails. Though basic Grapheme-tophoneme rules system is very simple yet it is very powerful for naturalness of a TTS system. Letter-to...

متن کامل

Phonology of Exceptions For Korean Grapheme-to-Phoneme Conversion

Being an essential part of a Korean speech recognition system and a Text-To-Speech (TTS) system, a Korean Grapheme-toPhoneme conversion system is generally composed of a set of regular rules and an exceptions dictionary [1, 2, 3]. The exceptions have been recorded in the dictionary in a simple and random manner, whereas the researches on the regular rules have been actively progressed. This pap...

متن کامل

Unlimited Vocabulary Grapheme to PhonemeConversion with Probabilistic Phrase Break Detection

This paper describes a grapheme-to-phoneme conversion method using phoneme con-nectivity and CCV conversion rules with probabilistic phrase break detection. The method consists of mainly four modules including phrase-break detection, morpheme normalization, morpheme to phoneme conversion and phoneme connectivity check. In the experiments with a test corpus of 210 sentences, we achieved 85% of p...

متن کامل

The Festvox Indic Frontend for Grapheme-to-Phoneme Conversion

Text-to-Speech (TTS) systems convert text into phonetic pronunciations which are then processed by Acoustic Models. TTS frontends typically include text processing, lexical lookup and Grapheme-to-Phoneme (g2p) conversion stages. This paper describes the design and implementation of the Indic frontend, which provides explicit support for many major Indian languages, along with a unified framewor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005